Dynamic behavior of cyclic automata networks
نویسندگان
چکیده
منابع مشابه
Dynamic Behavior of Cyclic Automata Networks
We study the principal dynamical aspects of the cyclic automata on finite graphs. We give bounds in the transient time and periodicity depending essentially on the graph structure. It is shown that there exist non-polynomial periods e 61(m) , where /V / denotes the number of sites in the graph. To obtain these results we introduce some mathematical tools as continuity, firing paths, jumps and e...
متن کاملDynamic of cyclic automata over Z2
Let K be the two-dimensional grid. Let q be an integer greater than 1 and let Q={0; : : : ; q−1}. Let s :Q → Q be de0ned by s( ) = ( + 1)mod q, ∀ ∈ Q. In this work we study the following dynamic F on QZ 2 . For x ∈ QZ2 we de0ne Fv(x)= s(xv) if the state s(xv) appears in one of the four neighbors of v in K and Fv(x) = xv otherwise. For x ∈ QZ2 , such that {v∈Z2 : xv = 0} is 0nite we prove that t...
متن کاملDynamic behavior of quantum cellular automata
We examine the dynamic behavior of quantum cellular automata, arrays of artificial quantum-dot cells that can be used to perform useful computations. The dynamics of the array can be solved directly, retaining the full many-electron degrees of freedom only for small array sizes. For larger arrays, we develop several approximate techniques for reducing the size of the basis set required. We exam...
متن کاملESTIMATION OF INVERSE DYNAMIC BEHAVIOR OF MR DAMPERS USING ARTIFICIAL AND FUZZY-BASED NEURAL NETWORKS
In this paper the performance of Artificial Neural Networks (ANNs) and Adaptive Neuro- Fuzzy Inference Systems (ANFIS) in simulating the inverse dynamic behavior of Magneto- Rheological (MR) dampers is investigated. MR dampers are one of the most applicable methods in semi active control of seismic response of structures. Various mathematical models are introduced to simulate the dynamic behavi...
متن کاملTree Automata for Analyzing Dynamic Pushdown Networks
Dynamic Pushdown Networks (DPNs) are an abstract model for concurrent programs with recursive procedures and dynamic process creation. Usually, DPNs are described with an interleaving semantics, where an execution is a sequence of steps. Recently, we introduced a true-concurrency semantics for DPNs, where executions are trees. The standard analysis methods for DPNs are based on a saturation alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)84104-2